A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares

We provide two new constructions for pairs of mutually orthogonal symmetric hamiltonian double Latin squares. The first is a tripling construction, and the second is derived from known constructions of hamilton cycle decompositions of when is prime.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.     

Robustly topological mixing of Kan's map

In 1994, I. Kan constructed a smooth map on the annulus admitting two physical measures, whose basins are intermingled. In this paper, we prove that Kan's map is $C^2$ robustly topologically mixing.     

Singular solutions of elliptic equations on a perturbed cone

In this work we obtain positive singular solutions of

$\{\begin{array}{ccc}?\mathrm{\Delta }u(y)\hfill & \hfill =\hfill & u{(y)}^p\text{ in }y\in {\mathrm{\Omega }}_t,\hfill \\ u\hfill & \hfill =\hfill & 0\text{ on }y\in ?{\mathrm{\Omega }}_t,\hfill \end{array}$

where ${\mathrm{\Omega }}_t$ is a sufficiently small $C^{2,\alpha }$ perturbation of the cone $\mathrm{\Omega }:=\{x\in {\mathbb{R}}^N:x=r\theta ,r>0,\theta \in S\}$ where $S?S^{N?1}$ has a smooth nonempty boundary and where $p>1$ satisfies suitable conditions. By singular solution we mean the solution is singular at the ‘vertex of the perturbed cone’. We also consider some other perturbations of the equation on the unperturbed cone Ω and here we use a different class of function spaces.     

On the threshold problem for Latin boxes

Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of K_n,n.     

Frame properties of systems arising via iterated actions of operators

Motivated by recent progress in dynamical sampling we prove that every frame which is norm-bounded below can be represented as a finite union of sequences ${\{{(T_j)}^n{\phi }_j\}}_{n=0}^{\infty },j=1,\dots ,J$ for some bounded operators $T_j$ and elements ${\phi }_j$ in the underlying Hilbert space. The result is optimal, in the sense that it turns out to be problematic to replace the collection of generators ${\phi }_1,\dots ,{\phi }_J$ by a singleton: indeed, for linearly independent frames we prove that we can represent the frame in terms of just one system ${\{T^n\phi \}}_{n=0}^{\infty }$, but unfortunately this representation often forces the operator T to be unbounded. Several examples illustrate the connection of the results to typical frames like Gabor frames and wavelet frames, as well as generic constructions in arbitrary separable Hilbert spaces.